SWORD - Module-based SAT Solving

نویسندگان

  • Robert Wille
  • Jean Christoph Jung
  • André Sülflow
  • Rolf Drechsler
چکیده

In this paper, we describe SWORD – a decision procedure for bit-vector logic that uses SAT techniques and exploits word level information [6]. The main idea of SWORD is based on the following observation: While current SAT solvers perform very well on instances with a large number of logic operations, their performance on arithmetic operations degrades with increasing data-path width. In contrast, pure word-level approaches are able to handle arithmetic operations very fast, but suffer from irregularities in the word-level structure (e.g. bit slicing). SWORD tries to combine the best of both worlds: On the one hand, it includes fast propagation, sophisticated data structures, as well as advanced techniques like non-chronological backtracking and learning from modern SAT solvers. On the other hand word-level information is exploited in the decision heuristic and during propagation. Additionally, rewriting on word-level and bitlevel is performed before starting the search process. In this sense, SWORD has certain similarities with SMT solvers (e.g. [2]).

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

SWORD v0.2 – Module-based SAT Solving

In this paper, we present SWORD – a SAT like solver that facilitates word level information. The main idea behind SWORD is based on the following observation: Current SAT solvers perform very well on instances with a large number of logic operations. But when more complex functions like arithmetic units are considered, the performance degrades with increasing data-path width. In contrast, pure ...

متن کامل

Extending Sat Solver with Parity Constraints

Current methods for solving Boolean satisfiability problem (SAT) are scalable enough to solve discrete nonlinear problems involving hundreds of thousands of variables. However, modern SAT solvers scale poorly with problems involving parity constraints (linear equations modulo 2). Gaussian elimination can be used to solve a system of linear equation effectively but it cannot be applied as such w...

متن کامل

Learning Hard Constraints in Max-SAT⋆

Solving over-constrained problems with Max-SAT solvers typically consists of finding an assignment that satisfies all the hard constraints and the maximum number of soft constraints. Despite the relevance of clause learning in SAT for solving structured instances, this technology has not yet been extended to Max-SAT. In this paper, we have incorporated a module that learns hard clauses in a bra...

متن کامل

Conflict-Driven XOR-Clause Learning

Modern conflict-driven clause learning (CDCL) SAT solvers are very good in solving conjunctive normal form (CNF) formulas. However, some application problems involve lots of parity (xor) constraints which are not necessarily efficiently handled if translated into CNF. This paper studies solving CNF formulas augmented with xor-clauses in the DPLL(XOR) framework where a CDCL SAT solver is coupled...

متن کامل

Foundations of Hierarchical SAT-Solving

The theory of hierarchical Boolean satisfiability (SAT) solving proposed in this paper is based on a strict axiomatic system and introduces a new important notion of implicativity. The theory makes evident that increasing implicativity is the core of SAT-solving. We provide a theoretical basis for increasing the implicativity of a given SAT instance and for organizing SAT-solving in a hierarchi...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009